A diametric theorem for edges
نویسندگان
چکیده
منابع مشابه
The Edge-Diametric Theorem in Hamming Spaces
The maximum number of edges spanned by a subset of given diameter in a Hamming space with alphabet size at least three is determined. The binary case was solved earlier by Ahlswede and Khachatrian [A diametric theorem for edges, J. Combin. Theory Ser. A 92(1) (2000) 1–16]. © 2007 Elsevier B.V. All rights reserved.
متن کاملThe Diametric Theorem in Hamming Spaces-Optimal Anticodes
Ž n . For a Hamming space X , d , the set of n-length words over the alphabet a H 4 n X s 0, 1, . . . , a y 1 endowed with the distance d , which for two words x s a H Ž . n Ž . n x , . . . , x , y s y , . . . , y g X counts the number of different components, 1 n 1 n a we determine the maximal cardinality of subsets with a prescribed diameter d or, in another language, anticodes with distance ...
متن کاملA Diametric Theorem in Z nm for Lee and Related Distances
We present the diametric theorem for additive anticodes with respect to the Lee distance in Zn2k , where Z2k is an additive cyclic group of order 2. We also investigate optimal anticodes in Znpk for the homogeneous distance and in Zm for the Krotov-type distance.
متن کاملModels of Multi-User Write-Efficient Memories and General Diametric Theorems
Write{e cient memories (WEM) were introduced by Ahlswede/Zhang as a model for storing and updating information on a rewritable medium. We strengthen the capacity theorem by providing a full control of the rates of the spreads. Next we adress and settle the storage capacity region problem under the average costs constraint in the case of many users, who write on the memory in an arbitrary order,...
متن کاملSome properties of Diametric norm and its isometries on B_0 (Bbb R)$
This article has no abstract.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006